Audience proposal creation and spot scheduling utilizing a framework for audience rating estimation

ABSTRACT

An audience proposal creator determines a target cost per thousand (CPM) baseline and a demographics CPM baseline for a deal offering audience spots, determines deal constraints based on a target CPM reduction goal, a demographics CPM cap, and the established parameters, and generates rates by selling title for each selling title-weeks for a duration of pending deal, and for each network of a plurality of networks based on the constraints. Target and demo audience rating estimates are acquired based on the target and demo applicable to the advertiser for the plurality of networks, and a distribution of the audience spots generated across the plurality of selling title-weeks, and networks based on the target audience rating estimates, a budget for the pending deal, the generated rates, and available inventory per selling title-weeks, and a proposal generated based on the distribution. An audience processor schedules audience spots across one or more networks for selling title-weeks based on the distribution.

CROSS-REFERENCE TO RELATED APPLICATIONS/INCORPORATION BY REFERENCE

This application makes reference to:

-   U.S. application Ser. No. 14/842,799, which was filed on Sep. 1,     2015; -   U.S. application Ser. No. 14/842,808, which was filed on Sep. 1,     2015; -   U.S. application Ser. No. 14/842,817, which was filed on Sep. 1,     2015; and -   U.S. application Ser. No. ______ (Attorney Docket No. TBS-1034     (1536140)), which is filed concurrently herewith.

Each of the above referenced patent application and patent is hereby incorporated herein by reference in its entirety.

FIELD OF TECHNOLOGY

Certain embodiments of the disclosure relate to targeting of advertisements. More specifically, certain embodiments of the disclosure relate to a method and system for audience proposal creation and spot scheduling utilizing a framework for audience rating estimation.

BACKGROUND

The process of creating proposals for a linear media plan for advertisers is iterative and time consuming, and is usually limited to a single network. The process of scheduling linear media advertisement spots into commercial breaks tends to be tedious and prone to errors. While some systems are available to receive an advertiser's order for the placement of spots into commercial breaks, these products either simply try to fill empty holes that exist within already scheduled commercial breaks on a first come, first placed basis, or do not address all requirements associated with the commercials. As a result, the systems currently available typically fail to honor all the constraints and requirements for each of the spots.

Further limitations and disadvantages of conventional and traditional approaches will become apparent to one of skill in the art, through comparison of such systems with some aspects of the present disclosure as set forth in the remainder of the present application with reference to the drawings.

BRIEF SUMMARY OF THE DISCLOSURE

Systems and/or methods are provided for audience proposal creation and spot scheduling utilizing a framework for audience rating estimation, substantially as shown in and/or described in connection with at least one of the figures, as set forth more completely in the claims.

These and other advantages, aspects and novel features of the present disclosure, as well as details of an illustrated embodiment thereof, will be more fully understood from the following description and drawings.

BRIEF DESCRIPTION OF SEVERAL VIEWS OF THE DRAWINGS

FIG. 1A is a block diagram that illustrates an exemplary system for receiving and processing spot scheduling orders, in accordance with an exemplary embodiment of the disclosure.

FIG. 1B is a diagram of the television advertisement management system, in accordance with an exemplary embodiment of the disclosure.

FIG. 1C is a flow chart illustrating high-level operation of the television advertisement management system of FIG. 1B, in accordance with an exemplary embodiment of the disclosure.

FIG. 2A is a diagram that illustrates a framework demo audience rating estimation for a media system, in accordance with various exemplary embodiments of the disclosure.

FIG. 2B is a diagram that illustrates a focus network determination for the framework for demo audience rating estimation for the media system of FIG. 2A, in accordance with various exemplary embodiments of the disclosure.

FIG. 2C is a diagram that illustrates an exemplary target matrix, in accordance with various exemplary embodiments of the disclosure.

FIG. 2D is a diagram that illustrates a focus network determination for the framework for target audience rating estimation based on the target matrix of FIG. 2C, in accordance with various exemplary embodiments of the disclosure.

FIG. 3 is a high-level diagram illustrating exemplary generation of audience rating estimates based on demographics and targets across one or more networks, in accordance with various exemplary embodiments of the disclosure.

FIG. 4A is a flow chart illustrating exemplary operations for processing a commercial break schedule by an advertisement scheduler, in accordance with an exemplary embodiment of the disclosure.

FIG. 4B is a flow chart illustrating exemplary operations for providing spot scheduling with targeting, in accordance with an exemplary embodiment of the disclosure.

FIG. 4C is a flow chart illustrating modification of the lift goal, in accordance with an exemplary embodiment of the disclosure.

FIG. 5A is a high-level diagram illustrating exemplary proposal generation for a pending deal, in accordance with an exemplary embodiment of the disclosure.

FIG. 5B is a diagram that illustrates example audience planning for a pending deal for an advertiser, in accordance with an exemplary embodiment of the disclosure.

FIG. 6 is a diagram that illustrates a distribution framework that may be utilized to generate unit (spot) distribution across networks and selling title-weeks combinations, in accordance with an exemplary embodiment of the disclosure.

FIG. 7 is a high-level flow chart illustrating exemplary audience placement for advertiser spots that have an audience guarantee, in accordance with an exemplary embodiment of the disclosure.

FIG. 8 is a flow chart illustrating exemplary operations for providing spot scheduling with advertisement scheduling, targeting, and/or audience scheduling, in accordance with various exemplary embodiments of the disclosure.

FIG. 9 is a conceptual diagram illustrating an example of a hardware implementation for a television advertisement management system employing a processing system for audience proposal creation and spot scheduling utilizing a framework for audience rating estimation, in accordance with an exemplary embodiment of the disclosure.

DETAILED DESCRIPTION OF THE DISCLOSURE

Certain embodiments of the disclosure may be found in a method and system for audience proposal creation and spot scheduling utilizing a framework for audience rating estimation. The framework for audience rating estimation may also be referred to as a framework or model for audience estimation or model for audience rating estimation. Traditionally, advertisement in television media has been measured by the number of people within a specific demographic (age range plus gender). Nowadays, advertisers want to create more focused advertising campaigns that target better the customers that will be exposed to them. The process of creating proposals for a linear media plan for advertisers is iterative and time consuming, is usually limited to individual networks, and is focused on measuring the overall value to the advertiser in terms of two main metrics: overall budget, and demo CPM (cost per thousand impressions within the advertiser primary target demographic). The combination of these two metrics yields a number of demo guaranteed impressions that the broadcaster has to deliver. Current systems cannot accommodate distributing units across selling titles in multiple networks at the same time, nor can they operate to process impressions from more targeted audience segments which are smaller than broader demographics expressed in terms of age and gender.

Various embodiments of the disclosure may comprise a hardware advertisement management system that communicates with a plurality of advertiser order generation systems and electronically receives, via a communication network, deals comprising orders from advertisers. The hardware advertisement management system may comprise, for example, an audience proposal creator, and an audience processor. The audience proposal creator may be operable to determine a target CPM baseline and a demo CPM baseline for a pending deal for an advertiser in which audience spots will be offered. The audience proposal creator may be operable to establish parameters for the pending deal for the advertiser, and may determine constraints to be imposed on the pending deal based on a target CPM reduction goal, a demographics CPM cap, and the established parameters, and generate rates by selling title for each selling title of a plurality of selling titles, for each week of a plurality of weeks for a duration of pending deal, and for each network of a plurality of networks, for the pending deal for the advertiser, based on the constraints. Concurrent with the establishing of the parameters, the determining of the constraints, and the generating of the rates by selling title, the audience proposal creator may be operable to acquire target and demo audience rating estimates based on the target and demo applicable to the advertiser for the plurality of networks. The audience proposal creator may be operable to generate a distribution of the audience spots across the plurality of selling titles, the plurality of weeks, and the plurality of networks based at least in part on the target audience rating estimates, a budget for the pending deal, the generated rates by selling title, and available inventory per selling title and weeks combination. As part of the process of generating the distribution, the generated distribution satisfies the determined constraints. The audience proposal creator may be operable to create or generate a proposal based on the distribution. The audience processor may schedule audience spots across one or more networks for selling title and weeks combinations based on the generated distribution. Exemplary parameters for the pending deal may include the budget, the target CPM reduction goal, the demographics CPM cap, and demographics rates per selling title to be charged per spot for the pending deal for the advertiser. The audience proposal creator may be operable to generate the distribution of the audience spots utilizing a distribution framework. Exemplary inputs to the distribution framework may include, but are not limited to, the budget, the target CPM reduction goal, and the demographics CPM cap, a maximum number of units to be allocated per selling title and week combination, a limit on the total number of units in the pending deal, a limit on the number of impressions and/or units percentages by network or selling title, a limit on rate increase, and/or an indication of whether to increase the rates in the same proportion.

FIG. 1A is a block diagram that illustrates an exemplary system for receiving and processing spot scheduling orders, in accordance with an exemplary embodiment of the disclosure. Referring to FIG. 1A, there is shown a television advertisement scheduling system 100 that is communicatively coupled to advertiser order generation systems 130 a, . . . , 130 n through a network 120. Consumer devices 132 a, . . . , 132 n are communicatively coupled to the network 120. The television advertisement scheduling system 100 may comprise a spot scheduler solver 110, an advertisement scheduler 112, a targeting processor 113, and an audience processor 114.

The network 120 may be any kind of network, or a combination of various networks, and it is shown illustrating the communication that may occur between the advertiser order generation systems 130 a, . . . , 130 n and the television advertisement scheduling system 100. For example, the network 120 may comprise one or more of a cable television network, the Internet, a satellite communication network, a wide area network (WAN), a medium area network (MAN), and a local area network (LAN).

The television advertisement scheduling system 100 may be operated by a broadcasting company and may comprise a spot scheduler solver 110. The broadcast company may be operable to multicast content via a plurality of channels, for example, traditional over-the-air broadcast channels, cable television networks, satellite communication networks, the Internet, and/or other content delivery networks. The spot scheduler solver 110 may comprise suitable logic, circuitry, code, and/or interfaces that may be operable to receive orders from one or more of the advertiser order generation systems 130 a, . . . , 130 n to place advertisements spots into one or more commercial breaks that occur during television programming broadcast. That is, the spot scheduler solver 110 may be utilized to determine the appropriate scheduling of advertisement spots to produce a commercial break schedule according to the information provided by the advertiser order generation systems 130 a, . . . , 130 n. The advertiser order generation systems 130 a, . . . , 130 n may place orders with the broadcasting company that include information about the type of spots to be broadcast, the number of spots to be broadcast, and when should the spots be aired. In this regard, the advertiser order generation systems 130 a, . . . , 130 n may electronically book spots to a selling title (ST), and within the selling title there are constraints. The advertiser order generation systems 130 a, . . . , 130 n may provide multiple orders, which need not be submitted at the same time. Therefore, the spot scheduler solver 110 may continuously receive orders with new or additional spots to be placed and may need to update any previously determined commercial break schedule to accommodate the constraints and requirements of those spots already placed and of the new spots being received.

The television advertisement scheduling system 100 may have a cutoff after which orders submitted by the advertiser order generation systems 130 a, . . . , 130 n may not be considered by the spot scheduler solver 110 when preparing a next commercial break schedule. A commercial break schedule may include a final or complete schedule of the spots that are to appear during a specified period of television programming such as hours, days, weeks, or a combination thereof.

Various embodiments of the disclosure, the television advertisement scheduling system 100, may comprise a spot scheduler solver 110 and an advertisement scheduler 112. Although the spot scheduler solver 110 and the advertisement scheduler 112 are illustrated as separate entities, they may be integrated as a single entity in which the advertisement scheduler 112 may be enabled or disabled utilizing, for example, one or more parameters. The television advertisement scheduling system 100 may be operable to electronically receive, via the communication network 120, deals comprising advertisers orders from the plurality of advertiser order generation systems 130 a, . . . , 130 n. The spot scheduler solver 110 may be operable to receive an advertiser's order to place one or more spots into one or more commercial breaks. The advertiser's order comprises airing constraints and placement requirements corresponding to the one or more spots, and each of the one or more commercial breaks comprises a plurality of inventory buckets. The airing constraints corresponding to each of the one or more spots comprise one or more of network constraints, selling title constraints, inventory type constraints, allowable date and time constraints, and advertiser conflict constraints. The placement requirements corresponding to each of the one or more spots comprise one or more of associative constraints, position constraints, time separation constraints, franchise and/or title exclusion constraints, and spot pinning constraints. The associative constraints define the positioning of any two or more spots relative to each other within the same one of the at least one of the plurality of inventory buckets or in adjacent inventory buckets. The position constraints define the positioning of any one spot in one of the at least one of the plurality of inventory buckets and/or in a commercial break.

A position of each of the plurality of inventory buckets within each of the one or more commercial breaks may define a sequencing order of each of the inventory buckets within each of the one or more commercial breaks, and each of the plurality of inventory buckets comprise a corresponding inventory type that indicates a type of content in each of the plurality of inventory buckets. The spot scheduler solver 110 may be operable to assign each of the one or more spots to at least one of the plurality of inventory buckets that are within each of the one or more commercial breaks based on the airing constraints and placement requirements. The spot scheduler solver 110 may be operable to match the characteristics of the assigned at least one of the plurality of inventory buckets that are within each of the one or more commercial breaks with the airing constraints and requirements of each of the one or more spots. The spot scheduler solver 110 may be operable to rank the one or more spots that are within each of the assigned at least one of the plurality of inventory buckets that are within each of the one or more commercial breaks based on the matching such that the airing constraints and placement requirements corresponding to the one or more spots are fulfilled. The spot scheduler solver 110 may be operable to reshuffle the one or more spots that are within each of the assigned at least one of the plurality of inventory buckets that are within each of the one or more commercial breaks. When at least one of the one or more spots are not assigned to the at least one of the plurality of inventory buckets that are within each of the one or more commercial breaks because of conflicts, the spot scheduler solver 110 may be operable to perform a prioritization scheme to complete the assignment of the one or more spots that are not assigned. The spot scheduler solver 110 may be operable to prioritize the spots based on arrival lead time such that all spots for a particular order are given same priority, and priorities are chosen such that a sum of all priorities post a certain arrival time is less than a priority on any spot prior to the certain arrival time. The spot scheduler solver 110 may also be operable to maximize the sum of the rates corresponding to the one or more spots. The spot scheduler solver 110 may also be operable to maximize the spread of days in which the one or more spots occur over the duration of the commercial break schedule. The spot scheduler solver 110 may be operable to generate a commercial break schedule based on the completed assignment of the one or more spots that are not assigned. It should readily be understood by one of skill in the art that other metrics may be utilized without departing from the spirit and scope of the various embodiments of the disclosure.

The spot scheduler solver 110 may also be operable to receive an additional advertiser's order to place one or more additional spots into the one or more commercial breaks, wherein the additional advertiser's order comprises constraints and placement requirements corresponding to the one or more additional spots. The spot scheduler solver 110 may also be operable to assign each of the one or more spots and the one or more additional spots to at least one of the plurality of inventory buckets within the one or more commercial breaks based on the corresponding constraints and placement requirements. When at least one of the one or more spots and the one or more additional spots is not assigned because of conflicts, the spot scheduler solver 110 may also be operable to perform a prioritization scheme to complete the assignment of the at least one spot that is not assigned. The spot scheduler solver 110 may also be operable to modify the generated commercial break schedule based on the completed assignment of the at least one spot that is not assigned. The spot scheduler solver 110 may be operable to communicate the generated commercial break schedule to the advertisement scheduler 112 for processing.

The advertisement scheduler 112 may be operable to receive the generated commercial break schedule, and determine a current indexing representative of the liability per pending spot for one or more of the deals which are guaranteed on demographic impressions. The advertisement scheduler 112 may be operable to reshuffle and prioritize the placement of the one or more spots based on one or more metrics such as a current indexing of the one or more deals in order to minimize liability associated with the one or more deals. The current indexing represents the projected liability per pending spot of a given deal and is determined based on what has already been aired, and what will be aired in the future. The reshuffling may be based on a forecast of expected demo viewership associated with the one or more deals. The advertisement scheduler 112 may be operable to generate a finalized commercial break schedule based on the reshuffling and apply the finalized schedule to the log. It should readily be understood by one of skill in the art that the other metrics other than the current indexing, which represents the projected liability per pending spot, may be utilized without departing from the spirit and scope of the various embodiments of the disclosure.

In accordance with various embodiments of the disclosure, an advertisement management system 100, which comprises a spot scheduler solver 110 and an advertisement scheduler 112, is operable to communicate with a plurality of advertiser order generation systems 130 a, . . . , 130 n, and electronically receives, via a communication network 120, deals comprising advertiser orders. The advertisement scheduler 112 receives a commercial break schedule generated from a completed assignment of one or more spots, wherein the one or more spots correspond to the deals comprising the advertiser orders to place the one or more spots into one or more commercial breaks in the commercial break schedule based on constraints and placement requirements. The advertisement scheduler 112 may determine a current indexing for one or more of the deals which are guaranteed on demographic impressions, and reshuffles the placement of the one or more spots based on the current indexing of the one or more deals in order to minimize liability associated with the one or more deals. The reshuffling is based on a forecast of expected viewership associated with the one or more deals. The reshuffling of the placement of the one or more spots is done across one or more channels airing the one or more spots. The advertisement scheduler 112 may generate a finalized commercial break schedule based on the reshuffling. The expected viewership may be forecasted for a particular period based in the status of prior logs. As an example, and without limitation, the expected viewership may be forecasted based on the status of the prior logs for an upcoming 7-day period.

The advertisement scheduler 112 may update a current forecast of expected demo viewership at the end of the particular period based on actual ratings for a prior week, which may be derived at last in part from Nielsen ratings and/or other data sources. The advertisement scheduler 112 may maximize delivery for candidate spots that are under-delivering (that is, underperforming deals or deals that are not pacing as expected, where pacing is a computation of cumulative demographics guaranteed so far, that is, at a particular point in time), and reshuffle the placement of the one or more spots such that the candidate spots get maximum delivery in order to minimize the liability. For example, the advertisement scheduler 112 may determine or identify candidate spots with liability above a certain value such as a threshold value, which indicates that the spots are not pacing as expected or under-delivering, and may reshuffle the placement of the one or more spots such that the candidate spots achieve maximum delivery, thereby minimizing liability. The candidate spots may be determined or identified based on their current delivery value. The advertisement scheduler 112 may determine each demographic for each of the one or more spots and generate, for each demographic, an estimate of the expected viewership associated with the one or more spots.

The advertisement scheduler 112 may generate the estimate of the expected viewership for specified time intervals. The time intervals may be, for example, 30-minute time intervals. The advertisement scheduler 112 may determine a current indexing for each of a plurality of the deals which are guaranteed on demographic impressions, and provide preferential treatment to placement of the one or more spots for one or more of the plurality of deals having greatest liability based on the determined current indexing when performing the reshuffling. The advertisement scheduler 112 may modify the forecast of expected demo viewership associated with the one or more deals based on a weighting factor, which may be updatable. The advertisement scheduler 112 may update the weighting factor over time to improve the current indexing of the one or more deals over time.

The targeting processor 113 may comprise suitable logic, circuitry, and interfaces that may be operable to execute code that may be operable to handle the processing of one or more orders in one or more deals that are targeting orders. The targeting processor 113 may be operable to acquire and/or determine target audience rating estimates for targeted spots, and may handle the placement of the targeted spots based on the audience rating estimates. The targeting processor 113 may also be operable to determine a lift goal, determine whether the lift goal may be achieved, and modify the lift goal in instances where the lift goal cannot be achieved.

The audience processor 114 may comprise suitable logic, circuitry, and interfaces that may be operable to execute code to schedule audience spots based on a distribution of audience spots that is generated utilizing a distribution framework. The distribution framework is utilized to generate a distribution of audience spots across a plurality of networks, across a plurality of selling titles, and across a plurality of weeks for the duration of a deal for an advertiser based on various inputs. The units for a particular advertiser order may then be booked based on the distribution for the selling title and weeks combinations across one or more the networks. The selling title and weeks combinations may also be referred to as selling title-weeks combinations, or selling title-weeks. While the targeting processor 113 is operable to target a single network, the audience processor 114 is operable to schedule audience spots across one or more networks for selling title-week combinations.

In accordance with an aspect of the disclosure, each of the advertisement scheduler 112, the targeting processor 113, or the audience processor 114 may operate independently. In another aspect of the disclosure, any two of the advertisement scheduler 112, the targeting processor 113, and/or the audience processor 114 may operate concurrently. In other aspects of the disclosure, the advertisement scheduler 112, the targeting processor 113, and the audience processor 114 may also operate concurrently, or may not operate at all. In this regard, in instances when the advertisement scheduler 112, the targeting processor 113, and the audience processor 114 do not operate, then only the spot scheduler solver 110 operates.

FIG. 1B is a diagram of the television advertisement management system, in accordance with an exemplary embodiment of the disclosure. Referring to FIG. 1 B, there is shown a television advertisement management system 140, which may be similar to the television advertisement management system 100 of FIG. 1A. The television advertisement management system 140 comprises proposal system 142, inventory system 144, traffic system 146, placement system 148, and advertisement scheduler 150, targeting processor 151, audience processor 153, and LOG/BINS 152. The proposal system 142, and the inventory system 144 may be referred to as an order booking system 154. The traffic system 146, the advertisement scheduler 150, the targeting processor 151, and the audience processor 153 may be referred to as a spot scheduler 156.

The proposal system 142 comprises hardware systems that are operable to create and negotiate proposals with the advertiser order generation systems 130 a, . . . , 130 n, which are illustrated in FIG. 1A, to produce one or more deals. A negotiated deal may have one or more orders. A demographics only deal may be specific to a single network. However, deals that have an audience component may span a plurality of networks. The proposal system 142 comprises a demographics (demo) proposal creator 142 a, a proposal converter 142 b, and an audience proposal creator 142 c.

The demographics proposal creator 142 a may comprise suitable logic, processor and/or circuitry, and interfaces that may enable execution of code to create and negotiate the demographics proposals.

The audience proposal creator 142 c may comprise suitable logic, processor and/or circuitry, and interfaces that may be operable to execute code that may be operable to create audience proposals across one or more networks. The audience proposal creator 142 c may also be referred to as a hardware audience proposal creator or a hardware audience proposal creator processor. The audience proposal creator 142 c may be operable to utilize a distribution framework to generate a distribution of audience spots across selling title-weeks across a plurality of the networks in order to create the audience proposals. The audience proposal creator 142 c utilizes the distribution framework to generate a distribution of audience spots across a plurality of networks, across a plurality of selling titles, and across a plurality of weeks for the duration of a deal for an advertiser based on various inputs. The inputs to the distribution framework may comprise, for example, for each network, and for each selling title and week combination, there is a corresponding rate parameter, demographics (demo) impressions or audience for each demo parameter, target impressions or audience for each target parameter, and an avails parameter, which represents the air time that is available to allocate spots. The inputs to the distribution framework are described in more detail with respect to, for example, FIG. 6, and its corresponding description.

The proposal converter 142 b may comprise suitable logic, processor and/or circuitry, and interfaces that is operable to facilitate execution of code to accept and convert the negotiated proposals to one or more orders. In this regard, the proposal converter 142 b is operable to receive and accept negotiated proposals from the demographics proposal creator 142 a, and the audience proposal creator 142 c and convert the negotiated proposals to one or more orders.

In accordance with an embodiment of the disclosure, in operation, the audience proposal creator 142 c may produce a distribution of audience spots utilizing the distribution framework. The distribution of audience spots shows the allocation of audience spots across a plurality of selling titles, across a plurality of weeks corresponding to the duration of a deal, and across a plurality of networks. The audience proposal creator 142 c may generate an audience proposal for a pending deal for an advertiser. Accordingly, audience spots maybe booked based on the distribution of the audience spots across the selling-title weeks and across the plurality of networks.

The inventory system 144 comprises inventory clearance system 144 a, and order modification system 144 b. The inventory clearance system 144 a is operable to clear the orders based on available inventory. The orders may be cleared, for example, on a first come first serve (FCFS) basis. When an order is received, the order may specify the x units be placed in selling title week A, y units be placed in selling title week B, and z units be placed in selling title week C, for example. Since there may be multiple bookings occurring, the inventory clearance system 144 a ensures the availability of the inventory for booking the required units for the order. The order modification system 144 b may be operable to change the attributes associated with an order that has already cleared inventory, add one or more units for an order to the inventory, or delete one or more units from inventory.

The traffic system 146 may comprise suitable hardware that may be operable to receive cleared and/or modified orders and queue them for assignment to an available spot scheduler solver. In this regard, the traffic system 146 a may comprise a hardware queue 146 a, and a plurality of spot scheduler solvers 146 b. The queue 146 a may be operable to queue cleared and/or modified orders by the traffic system 146. The traffic system 146 may assign the cleared and/or modified orders that are queued in the queue 146 a to an available spots scheduler solver in the pool of spot scheduler solvers 146 b for spot scheduling. The placement system 148 is operable to place the spots on the logs/bins 152 based on the results from the spot scheduler solvers.

The advertisement scheduler 150 may be operable to receive the generated commercial break schedule, determine a current indexing representative of the liability per pending spot for one or more of the deals which are guaranteed on demographic impressions, reshuffle and prioritize the placement of the one or more spots based on one or more metrics such as a current indexing of the one or more deals in order to minimize liability associated with the one or more deals. The reshuffling may be based on a forecast of expected demo viewership associated with the one or more deals. The advertisement scheduler 150 generates a finalized commercial break schedule based on the reshuffling and applies the finalized schedule to the log.

The targeting processor 151 may handle the processing of targeting orders. In this regard, the targeting processor 151 may be operable to acquire and/or determine target audience rating estimates for targeted spots, and may handle the placement of the targeted spots based on the target audience rating estimates. The targeting processor 151 may also be operable to determine a lift goal, determine whether the lift goal is achievable, and modify the lift goal in instances where the lift goal is not achievable.

The audience processor 153 may handle the audience scheduling operations related to deals. For example, the audience processor 153 may be operable to schedule audience spots based on the distribution of audience spots that is generated or produced by the audience proposal creator 142 c based on a distribution framework. The distribution framework is utilized to generate a distribution of audience spots across a plurality of networks, across a plurality of selling titles, and across a plurality of weeks for the duration of a deal for an advertiser based on various inputs. The audience processor 153 may schedule the units for a particular advertiser order based on the distribution for the selling title-weeks combinations across one or more networks

Orders requiring advertisement scheduling may be processed by the advertisement scheduler 150 and placed on the logs/bins 152 based on the results from the advertisement scheduler 150. The advertisement scheduler 150, the targeting processor 151, and/or the audience processor 153 may operate independently, or concurrently. For example: (1) any one of the advertisement scheduler 150, the targeting processor 151, and/or the audience processor 153 may operate independently; (2) any two of the advertisement scheduler 150, the targeting processor 151, and/or the audience processor 153 may operate concurrently; (3) the advertisement scheduler 150, the targeting processor 151, and the audience processor 153 may operate all concurrently; or (4) neither of the advertisement scheduler 150, the targeting processor 151, and the audience processor 153 may operate, and in this case, only the spot scheduler solver 110 operates.

FIG. 1C is a flow chart illustrating high-level operation of the television advertisement management system of FIG. 1B, in accordance with an exemplary embodiment of the disclosure. Referring to FIG. 1C, there are shown exemplary operations 161 through 167. At 161, the demo proposal creator 142 a and/or the audience proposal creator 142 c create proposals. At 162, the proposal converter 142 b receives and converts the proposals to one or more orders. At 163, the inventory clearance system 144 a receives the orders and clears the inventory. At 164, if orders require modification, the order modification system 144 b modifies the orders. At 165, the traffic system 146 receives cleared and/or modified orders with spots that have cleared inventory and queues them in the queue 146 a for spot scheduling. At 166, the traffic system 146 determines availability of spot scheduling solvers from a pool of spot scheduling solvers 146 b, assigns one or more spot scheduling solvers to process the spots, and handles the scheduling and the targeting of orders. At 167, the placement system 148 places the spots on the log/bins 152 based on the results from the spot scheduler solvers.

FIG. 2A is a diagram that illustrates a framework for demo audience rating estimation for a media system, in accordance with various exemplary embodiments of the disclosure. Referring to FIG. 2A, there is shown an exemplary base matrix 200 comprising a plurality of columns and a plurality of rows. Each of the plurality of columns represents a particular network among all networks, and each of the rows represents the 48 30-minute periods/segments in a day (24-hour period). As illustrated, there are shown exemplary networks, TBS, TNT, TruTV, CNN, ABC, CBS, NBC, . . . , FOX, USA, FX, and A&E.

Each element in the base matrix 200 may be represented by a demo matrix, which comprises a plurality of demo matrix elements, representing all demographics. For example, demo matrix 210 represents all the demographics for TBS network, for the 0-30 (1^(st)) 30-minute period. The demo matrix 210 comprises demo matrix elements 210 a, 210 b, 210 c, . . . , 210(N-1), 210N, where N is an integer greater than or equal to 1. Demo matrix element 210 a comprises a first demo D1 for TBS, which includes all program attributes (PA), and time attributes (TA), and is collectively represented as D1_TBS[PA,TA]. Demo matrix element 210 b comprises a second demo D2 for TBS, which includes all program attributes (PA), and time attributes (TA), and is collectively represented as D2_TBS[PA,TA]. Demo matrix element 210 c comprises a third demo D3 for TBS, which includes all program attributes (PA), and time attributes (TA), and is collectively represented as D3_TBS[PA,TA]. . . . Demo matrix element 210(N-1) comprises a (N-1)^(th) demo D(N-1for TBS, which includes all program attributes (PA), and time attributes (TA), and is collectively represented as DN-1_TBS[PA,TA]. Demo matrix element 210(N) comprises a N^(th) demo D(N) for TBS, which includes all program attributes (PA), and time attributes (TA), and is collectively represented as DN-1_TBS[PA,TA].

The demo matrix 212 represents all the demographics for TBS network, for the 1350-1380 (46^(th)) 30-minute period. The demo matrix 212 comprises demo matrix elements 212 a, 212 b, 212 c, . . . , 212(N-1), 212N, where N is an integer greater than or equal to 1. Demo matrix element 212 a comprises a first demo D1 for TBS, which includes all program attributes (PA), and time attributes (TA), and is collectively represented as D1_TBS[PA,TA]. Demo matrix element 212 b comprises a second demo D2 for TBS, which includes all program attributes (PA), and time attributes (TA), and is collectively represented as D2_TBS[PA,TA]. Demo matrix element 212 c comprises a third demo D3 for TBS, which includes all program attributes (PA), and time attributes (TA), and is collectively represented as D3_TBS[PA,TA]. . . . Demo matrix element 212(N-1 comprises a (N-1)^(th) demo D(N-1 for TBS, which includes all program attributes (PA), and time attributes (TA), and is collectively represented as DN-1_TBS[PA,TA]. Demo matrix element 212(N) comprises a N^(th) demo D(N) for TBS, which includes all program attributes (PA), and time attributes (TA), and is collectively represented as DN-1_TBS[PA,TA].

The demo matrix 214 represents all the demographics for USA network, for the 180-210 (7^(th)) 30-minute period. The demo matrix 214 comprises demo matrix elements 214 a, 214 b, 214 c, . . . , 214(N-1), 214N, where N is an integer greater than or equal to 1. Demo matrix element 214 a comprises a first demo D1 for USA, which includes all program attributes (PA), and time attributes (TA), and is collectively represented as D1_USA[PA,TA]. Demo matrix element 214 b comprises a second demo D2 for USA, which includes all program attributes (PA), and time attributes (TA), and is collectively represented as D2_USA[PA,TA]. Demo matrix element 214 c comprises a third demo D3 for USA, which includes all program attributes (PA), and time attributes (TA), and is collectively represented as D3_USA[PA,TA]. . . . Demo matrix element 214(N-1 comprises a (N-1)^(th) demo D(N-1) for USA, which includes all program attributes (PA), and time attributes (TA), and is collectively represented as DN-1_USA[PA,TA]. Demo matrix element 214(N) comprises a N^(th) demo D(N) for USA, which includes all program attributes (PA), and time attributes (TA), and is collectively represented as DN-1_USA[PA,TA].

Each demo matrix element for each network includes program attributes, and time attributes, which may be represented as a matrix [PA,TA]. Exemplary time attributes may comprise the following:

-   -   Quarter, Year (if necessary), which may be represented as         variables;     -   Daily seasonality, which may be represented as a linear         combination of trigonometric functions;     -   Day of week (DOW), which may be represent as variables;     -   Half hour, which may be represented as variables, for example,         8:00-8:30, 8:30-9:00;     -   Holidays and special events, for example, Super Bowl, Labor Day         Sunday and Monday, 4^(th) of July (Independence Day), Christmas         Day, and New Year's Eve, and may be represented as variable.

Exemplary program attributes may comprise the following:

-   -   Genre by network/competitor:         -   a. “light content” (soap, comedy, variety, game, music,             reality);         -   b. “heavy content” (documentary, drama, current affairs,             news, science, travel);         -   c. Sports;         -   d. Movies; and         -   e. News;         -   for each type of competitor (bucket), for example, Broadcast             light content, Non-Owned Cable light content;     -   Repeat/Premiere/Live (from Nielsen)     -   Duration (in min)     -   Same program indicator—half hour (hhr) is within same program as         previous (calculated)     -   Lead in genre match—half hour (hhr) starts a program similar         with previous hhr's program (calculated), where genre is light,         heavy, sports or movies         It should be recognized by those skilled in the art that other         time attributes and/or program attributes may be utilized         without departing from the spirit and/or scope of the various         embodiments of the disclosure.

For a given 30-minute period, the probability of a consumer choosing to watch what is on a particular channel is a function of what is currently airing on that particular channel, and what the competitors are airing within the same 30-minute period. For example, the probability for a consumer watching TBS network for a given 30-minute period, P_(hhr,TBS) may be represented by the following expression:

$\begin{matrix} {P_{{hhr},{TBS}} = \frac{^{\beta_{TBS} \cdot x_{p_{{hhr},{TBS}}}}}{\sum\limits_{i = {TBS}}^{Others}^{\beta_{i}x_{p_{{hhr},i}}}}} & \left( {{equation}\mspace{14mu} 1} \right) \end{matrix}$

where:

-   x=program attributes and time attributes; -   β=vector of weights to be estimated for a particular network e.g.     β_(TBS)=vector of weights to be estimated for TBS. -   The program attributes and time attributes may be referred to as     covariates, and may be received from one or more entities and/or     storage devices that provide media analytical information, for     example, Nielsen.

The P_(hhr,TBS) for equation 1 may be simplified and represented as:

In(Demo(000)_(hhr,TBS))=β_(TBS).x_(p) _(hhr,TBS)   (equation 2)

In accordance with an exemplary embodiment of the disclosure, equation 2 may be estimated through minimizing squared errors (MSE) utilizing non-linear optimization.

In accordance with various embodiments of the disclosure, the competitor networks may be bucketized, i.e. placed into buckets or bins. The following illustrates exemplary competitor buckets:

-   -   Owned competitors—for example, TBS, TNT, ADSM, TruTV, etc are         owned by the same entity, and thus compete against each other;     -   Broadcast competitors—ABC, CBS, NBC, FOX, CW, ION;     -   Non-Owned cable competitors—USA, Spike, FX, A&E, Lifetime, CM         DY; and     -   All other networks.

The base matrix 200 as illustrated contains data for a single day. The structure of the base matrix 200 may be replicated 365 times and populated with the corresponding program attributes and time attributes for a single year. This resulting structure may be replicated and populated with the corresponding program attributes and time attributes to provide a corresponding plurality of years of data.

FIG. 2B is a diagram that illustrates a focus determination for the framework for demo audience rating estimation for a media system of FIG. 2A, in accordance with various exemplary embodiments of the disclosure. Referring to FIG. 2B, there is shown an exemplary focus matrix 230 including a focus network, TBS, and the bucketized networks in buckets, B1, B2, B3, and B4. The focus matrix 230 represents information for the 0-30 minute period of the base matrix 200 illustrated in FIG. 2A. A similar matrix may be generated for each remaining time periods for TBS, which are illustrated in FIG. 2A.

Consider the first demo D1 in the 0-30 minute period (FIG. 2A), for TBS, with the program attributes PA, and time attributes TA, collective referenced as D1_TBS[PA,TA], 232 a. The values for D1_TBS[PA,TA] are acquired from the demo matrix element 210 a, in FIG. 2A. For the first demo D1, a vector of the sum (Σ(PA,TA)) of program attributes and the time attributes for the each of the owned competitor networks, which are in bucket 1 is determined. The vector of the sum (Σ(PA,TA)) is determined by adding the individual contribution for each owned competitor network in bucket B1, which is found in the row for 0-30 minute (first 30-minute) period of the base matrix 200 illustrated in FIG. 2A, for a period of, for example, 1 year. Since different shows may be presented in the 0-30 minute period, the vector of the sum (Σ(PA,TA)) for bucket B1 is weighted. The resulting weighted vector for the summed attributes of content for the networks in bucket B1, may be represented as [W(Σ(PA,TA))]D1, B1]. An example weighted vector for the summed attributes of content for the networks in bucket B1 may comprise 60% light content, 20% news, 10% sport, and 10% movies, and is represented by reference number 232 b-1.

Bucket B2 is handled in a similar manner as bucket B1. In this regard, the vector of the sum (Σ(PA,TA)) is determined by adding the individual contribution for each owned competitor network in bucket B2, which is found in the row for 0-30 minute (first 30-minute) period of the base matrix 200 illustrated in FIG. 2A, for a period of, for example, 1 year. Since different shows may be presented in the 0-30 minute period, the vector of the sum (Σ(PA,TA)) for bucket B2 is weighted. The resulting weighted vector for the summed attributes of content for the networks in bucket B1, may be represented as [W(Σ(PA,TA))]D1, B2]. An example weighted vector for the summed attributes of content for the networks in bucket B2 may comprise 50% heavy content, 30% news, and 20% sport, and is represented by reference number 232 c-1.

Bucket B3 is handled in a similar manner as buckets B1 and B2. In this regard, the vector of the sum (Σ(PA,TA)) is determined by adding the individual contribution for each owned competitor network in bucket B3, which is found in the row for 0-30 minute (first 30-minute) period of the base matrix 200 illustrated in FIG. 2A, for a period of, for example, 1 year. Since different shows may be presented in the 0-30 minute period, the vector of the sum (Σ(PA,TA)) for bucket B3 is weighted. The resulting weighted vector for the summed attributes of content for the networks in bucket B3, may be represented as [W(Σ(PA,TA))]D1, B3]. An example weighted vector for the summed attributes of content for the networks in bucket B2 may comprise 30% light content, 30% news, 20% sport, and 20% movies, and is represented by reference number 232 d-1.

Bucket B4 is handled in a similar manner as buckets B1, B2, and B3. In this regard, the vector of the sum (Σ(PA,TA)) is determined by adding the individual contribution for each owned competitor network in bucket B4, which is found in the row for 0-30 minute (first 30-minute) period of the base matrix 200 illustrated in FIG. 2A, for a period of, for example, 1 year. Since different shows may be presented in the 0-30 minute period, the vector of the sum (Σ(PA,TA)) for bucket B4 is weighted. The resulting weighted vector for the summed attributes of content for the networks in bucket B4, may be represented as [W(Σ(PA,TA))]D1, B3]. An example weighted vector for the summed attributes of content for the networks in bucket B4 may comprise 60% light content, 30% news, and 10% sport, and is represented by reference number 232 e-1.

Utilizing the variables generated through the operations described above with respect to FIG. 2A and FIG. 2B., and equation 1 and equation 2, the most common approach is to estimate the parameters of this statistical model (the betas) utilizing maximum likelihood estimation techniques.

This may be repeated for all the demos in the 0-30 minute period, so that each demo may have a corresponding β vector. Once all the demos for the 0-30 minute period are completed, the entire process may be repeated for the second 30-minute period (30-60), and so on until all corresponding values of β for all demos in the 48^(th) 30-minute period are completed.

The framework illustrated in FIG. 2A and 2B may be utilized for predictive modeling to determine viewership for an upcoming quarter. Once the β vector for a particular network is determined, this may be utilized to forecast or predict the viewership for an upcoming quarter for the particular network. In order to forecast the viewership for TBS for the upcoming quarter, the program schedule for the TBS and the program schedule for the competing networks are needed. Assume that today is Apr. 5, 2015, which is roughly the start of the second quarter 2Q15 and that the model illustrated in FIG. 2A and FIG. 2B includes data for the prior four quarters, namely, 2Q14, 3Q14, 4Q14, and 1Q15. Furthermore, it is assumed that all ratings and viewership information, for example, Nielsen data, for all prior periods have been received and are included in the model illustrated in FIG. 2A and FIG. 2B.

While the program schedule for the TBS network for 2Q15 is known, the program schedule for the competitors may not be known. However, it may be assumed that the mix of program for the upcoming quarter is the same as it was for the same quarter in the prior year. Accordingly, an assumption is made that the mix of program for 2Q15 is approximately the same as the mix of program in 2Q14, which may be determined from the bucketized networks as illustrated in FIG. 2B (e.g. 231 b-1, 232 c-1, 232 d-1, 232 e-1). If it is known that there is a change to the programming in a particular bucket, then the program mix in the bucket may be adjusted accordingly. This information may be utilized to forecast the viewership for every demo, and for every 30-minute period in the upcoming quarter utilizing the values that were calculated for β. The entire process may be repeated for other networks in order to forecast viewership for those other networks for the upcoming quarter. Furthermore, the various embodiments of the disclosure are not limited to forecasting the current quarter, Q215. Accordingly, the model presented in FIG. 2A and FIG. 2B may also to utilize to forecast or predict viewership for 3Q15, for example.

Since consumer behavior is constantly changing, the β vector for a particular network may be updated based on these changes in the consumer behavior. Accordingly, for example, once all the data for a quarter has been received, the β vector for each particular network may be updated to reflect the changes in consumer behavior.

Although the various embodiments of the disclosure presented with respect to the model in FIG. 2A and FIG. 2B are utilized to predict the viewership for an owned network, it should be recognized that the disclosure is not limited in this regard. Accordingly, the model in FIG. 2A and FIG. 2B may also be utilized to predict viewership for competitor networks.

The digital age allows individual tracking of consumers by sellers/advertisers since the sellers know the viewers they are interacting with and can more readily learn their habits and preferences. Consumers and viewers are tracked based on online preferences, tracking cookies, Internet browsing habits, and location based services (LBS) to name a few. Based on this knowledge and habits of the consumers and viewers, data from a plurality of data analytics sources may be fused together to provide more granular results. In this regard, analytical information provided for a particular demo may give a breakdown of one or more categories that may fall within that particular demo. For example, within the demo for people age 25-54, P[25-54], at the 39^(th) 30-minute period (7:30-8:00 pm), which has a viewership of 1M, 500K of the 1M viewers are cereal buyers. Given such granularity, an advertiser of cereal would be more interested in targeting the 500K cereal buyers rather that the entire 1M viewers.

Although targeting may operate with similar constraints as advertisement scheduling, aspects of targeting may be geared towards targeting segments of a certain population on a more granular level. For example, consider the target [auto intenders], which includes people who intent to by automobiles. The target [Auto intenders] may comprise, a first level of sub-targets, for example, [Ford branded autos], [Toyota branded autos], [Honda branded Autos], and so on. Each of the first level of sub-targets may comprise a second level of sub-targets. For example, target [Ford branded autos] may comprise second level sub-targets [Ford Sedans], [Ford SUVs], [Ford Trucks], and target [Toyota branded autos] may comprise second level sub-targets [Toyota Sedans], [Toyota SUVs], [Toyota Trucks], [Toyota Cross Overs], and so on. The second level sub-targets [Ford Trucks] may comprise third level sub-targets, for example, [Ford light trucks], and [Ford heavy duty trucks]. This level of granularity enables targeting to zero in on specific segments to provide a certain percentage lift during placement of targeting spots. Additional sub-levels of targets may be employed without departing from the spirit and scope of the disclosure.

The framework illustrated in FIG. 2A, and FIG. 2B may be modified such that the demos D1, D2, D3, . . . , DN may be replaced by targets, and a β vector may be determined for each of the targets and for each of the networks. Exemplary targets may comprise cereal buyers, yogurt buyers, credit card buyers, luxury car buyers, buyers of US made cars, and buyers of foreign made cars. A matrix of the targets may be generated and advertisement may be more efficiently scheduled based on how targeting deals are sold.

FIG. 2C is a diagram that illustrates an exemplary target matrix, in accordance with various exemplary embodiment of the disclosure. Referring to FIG. 2C, there is shown target matrix 235, which comprises exemplary target matrix 240, 242, and 244, each having corresponding elements referenced as 240 a, 240 b, 240 c, . . . , 240(N-1), 240(N); 242 a, 242 b, 242 c, . . . , 242(N-1), 242(N); and 244 a, 244 b, 244 c, . . . , 244(N-1), 244(N), respectively.

FIG. 2D is a diagram that illustrates a focus determination for the framework for target audience rating estimation based on the target matrix of FIG. 2C, in accordance with various exemplary embodiments of the disclosure. Referring to FIG. 2D, there is shown an exemplary focus matrix 260 including a focus network, TBS, and the bucketized networks in buckets, B1, B2, B3, and B4. The focus matrix 230 represents information for the 0-30 minute period of the base matrix 200 illustrated in FIG. 2C. A similar matrix may be generated for each remaining time periods for TBS, which are illustrated in FIG. 2D.

Consider the first target T1 in the 0-30 minute period (FIG. 2C), for TBS, with the program attributes PA, and time attributes TA, collective referenced as T1_TBS[PA,TA],262 a. The values for T1_TBS[PA,TA] are acquired from the demo matrix element 240 a, in FIG. 2C. For the first target T1, a vector of the sum (Σ(PA,TA)) of program attributes and the time attributes for the each of the owned competitor networks, which are in bucket 1 is determined. The vector of the sum (Σ(PA,TA)) is determined by adding the individual contribution for each owned competitor network in bucket B1, which is found in the row for 0-30 minute (first 30-minute) period of the base matrix 235 illustrated in FIG. 2C for a period of, for example, 1 year. Since different shows may be presented in the 0-30 minute period, the vector of the sum (Σ(PA,TA)) for bucket B1 is weighted. The resulting weighted vector for the summed attributes of content for the networks in bucket B1, may be represented as [W(Σ(PA,TA))]T1,B1]. An example weighted vector for the summed attributes of content for the networks in bucket B1 may comprise 30% light content, 20% news, 40% sport, and 10% movies, and is represented by reference number 262 b-1.

Bucket B2 is handled in a similar manner as bucket B1. In this regard, the vector of the sum (Σ(PA,TA)) is determined by adding the individual contribution for each owned competitor network in bucket B2, which is found in the row for 0-30 minute (first 30-minute) period of the base matrix 235 illustrated in FIG. 2C, for a period of, for example, 1 year. Since different shows may be presented in the 0-30 minute period, the vector of the sum (Σ(PA,TA)) for bucket B2 is weighted. The resulting weighted vector for the summed attributes of content for the networks in bucket B1, may be represented as [W(Σ(PA,TA))]T1,B2]. An example weighted vector for the summed attributes of content for the networks in bucket B2 may comprise 40% heavy content, 30% news, and 30% sport, and is represented by reference number 262 c-1.

Bucket B3 is handled in a similar manner as buckets B1 and B2. In this regard, the vector of the sum (Σ(PA,TA)) is determined by adding the individual contribution for each owned competitor network in bucket B3, which is found in the row for 0-30 minute (first 30-minute) period of the base matrix 235 illustrated in FIG. 2C, for a period of, for example, 1 year. Since different shows may be presented in the 0-30 minute period, the vector of the sum (Σ(PA,TA)) for bucket B3 is weighted. The resulting weighted vector for the summed attributes of content for the networks in bucket B3, may be represented as [W(Σ(PA,TA))]T1,B3]. An example weighted vector for the summed attributes of content for the networks in bucket B2 may comprise 30% light content, 30% news, 5% sport, and 35% movies, and is represented by reference number 262 d-1.

Bucket B4 is handled in a similar manner as buckets B1, B2, and B3. In this regard, the vector of the sum (Σ(PA,TA)) is determined by adding the individual contribution for each owned competitor network in bucket B4, which is found in the row for 0-30 minute (first 30-minute) period of the base matrix 235 illustrated in FIG. 2C, for a period of, for example, 1 year. Since different shows may be presented in the 0-30 minute period, the vector of the sum (Σ(PA,TA)) for bucket B4 is weighted. The resulting weighted vector for the summed attributes of content for the networks in bucket B4, may be represented as [W(Σ(PA,TA))]T1,B3]. An example weighted vector for the summed attributes of content for the networks in bucket B4 may comprise 40% light content, 40% news, and 20% sport, and is represented by reference number 262 e-1.

Utilizing the variables, which correspond to targets instead of demos, as generated through the operations described above with respect to FIG. 2C and FIG. 2D, and equation 1 and equation 2, the most common approach is to estimate the parameters of this statistical model (the betas) utilizing maximum likelihood estimation techniques.

This may be repeated for all the targets in the 0-30 minute period, so that each target may have a corresponding 13 vector. Once all the targets for the 0-30 minute period are completed, the entire process may be repeated for the second 30-minute period (30-60), and so on until all corresponding values of β for all targets in the 48^(th) 30-minute period are completed.

A composite matrix comprising demos and targets may be generated, based on, for example, FIG. 2B, and FIG. 2D.

The framework for audience rating estimation may be utilized to generate, for example, an estimate of the percentage audience that may be engaged in a certain activity. For example, the framework for audience rating estimation may generate a percentage average audience and/or a percentage total audience. In another aspect of the disclosure, the framework for audience rating estimation may generate an estimate of the actual number of persons that may be engaged in a certain activity. In this regard, the framework for audience rating estimation may generate an actual average audience or an actual total audience that may be engaged in a certain activity based on a generated forecast of the average total audience and a forecast of the total audience.

The framework for audience rating estimation may take into account the nesting effect within a program. The nesting effect refers to the various factors that may affect the program. Each program may have a specific effect, and this effect may be referred to as the baseline effect. Each program has a fixed audience that is expected.

Based on the factors that may affect the program, the framework for audience rating estimation may add or subtract from the fixed audience. For example, every 30-minute period may have an effect on the program, and seasonality or special events may have an effect on the program.

FIG. 3 is a high-level diagram illustrating exemplary generation of audience rating estimates based on demographics and targets across one or more networks, in accordance with an exemplary embodiment of the disclosure. Referring to FIG. 3, there are shown sources of projected audience data 302, library 304, audience rating estimation generator 305, storage 310, television programming scheduling system 312, and program schedule data 314.

The sources of projected audience data 302 may comprise a plurality of audience data sources 302 a, . . . , 302 n. Each of the plurality of audience data sources 302 a, . . . , 302 n are operable to generate projected audience data for one or more of the broadcast provider's networks. One or more of the audience data sources 302 a, . . . , 302 n may be operable to communicate projected audience data to the library 304. Nielsen may be an example of an audience data source.

The library 304 comprises a repository for storing data. In this regard, the library 304 may comprise demographics (demo) data 304 a, and target data 304 b.

The audience rating estimate generator 305 may generate audience rating estimates for all selling title-weeks across one or more of the networks that are operated by the broadcast provider. In this regard, at 306, the audience rating estimates may be generated for all selling title-weeks across one or more of the networks utilizing the program schedule data 314 by (1) demographics based on the demographics data 304 a, or (2) target based on the target data 304 b. The program schedule data 314 may be received from the television programming scheduling system 312. At 308, the audience rating estimates for all selling title weeks across one or more networks by demographics, and by target, may be stored in the storage 310. The audience rating estimate generator 305 may be part of the audience proposal creator 142 c.

The storage 310 may be, for example, any kind storage device such as a disc, solid state memory, or other storage system such as a network attached storage system (NAS) or cloud-based storage system. The audience rating estimates for all selling title-weeks across one or more networks by demographics and by target may be stored in a database within the storage 310. It should be recognized by those skilled in the art that although the library 304 is illustrated differently from the storage 310, the library 304 may be integrated within the storage 310.

FIG. 4A is a flow chart illustrating exemplary operations for processing a commercial break schedule by an advertisement scheduler, in accordance with an exemplary embodiment of the disclosure. Referring to FIG. 4A, there is shown a flow chart 400 that describes example operations 402 through 412 for processing by the advertisement scheduler 112.

At 402, the advertisement scheduler 112 may receive a commercial break schedule generated from a completed assignment of one or more spots for deals for processing.

At 404, the advertisement scheduler 112 may determine a current indexing for the deals. The current indexing may represent the projected liability per pending spot and is determined based on what has already been aired, and what will be aired in the future.

At 406, the advertisement scheduler 112 may determine a forecast of expected demo viewership associated with constraints and/or demographics for the deals is determined. In some embodiments of the disclosure, the advertisement scheduler 112 may determine a weighting value for adjusting the forecast.

At 408, the advertisement scheduler 112 may reshuffle the placement of the one or more spots based on the indexing and the forecast. In instances where the weighting value for adjusting the forecast is determined, the advertisement scheduler 112 may be operable to reshuffle the placement of the one or more spots based on the indexing and the weighted forecast. The weighting factor may be generated based on historical analysis of demographics estimates, for every demographics, for every network including what is airing on the networks of competitors, at the 30-minute interval, and for an extended period, for example, one or more months, or one or more years. The weighting factor may take on a range of values, each of which may be updated. In instances where the estimates may be dependent on previous estimates, then a weighting factor may be utilized in combination with the previous estimate to weigh the error of the previous estimate and measurement. The weighting factor may be: (i) a constant: it may be a system parameter chosen based on data and model performance analysis, for example, prior to system roll out. This constant can be reassessed, if need, periodically e.g. yearly; (ii) time-varying: the weight changes at every time step depending on the estimates and observations variance; (iii) adaptive: the weight changes at every time step as a function of the estimates error variance. In this regard, the adaptive weight may be viewed as time varying as a function of error

At 410, the advertisement scheduler 112 may generate a finalized schedule based on the shuffling. At 412, the advertisement scheduler 112 may apply the finalized commercial break schedule to the log/bin 152, or communicate the finalized commercial break schedule to the spot scheduler solver 110 for application to the log/bin 152. Additional details on advertisement scheduling are disclosed in U.S. application Ser. No. 14/842,799, which was filed on Sep. 1, 2015.

FIG. 4B is a flow chart illustrating exemplary operations for providing spot scheduling with targeting, in accordance with an exemplary embodiment of the disclosure. Referring to FIG. 4B, there are shown a flow chart 420 comprising exemplary operations 422 through 436. The exemplary operations 420 through 436 may be performed by one or more components and/or functions of the television management system 100, for example, the targeting processor 113.

At 422, a spot scheduler job is initiated. At 424, it is determined whether the prior week log is in a state to run targeting. If at 424 it is determined that the prior week log is not in a state to run targeting, then at 426, it is not a targeted job.

If at 424 it is determined that the prior week log is in a state to run targeting, then at 428, it is determined whether there are targeted spots in the job. At 428, if it is determined that there are no targeted spots in the job, then 426, it is not a targeted job. If at 428 it is determined that there are targeted spots in the job, then at 430, all target estimates for all specified targets in the job are acquired. At 432, the baseline target delivery for the selling title is calculated. At 434, a lift factor and/or an error factor are applied to the baseline targeted delivery to set a benchmark. At 436, the job is solved with minimum constraints for targets set equal to a benchmark by order. Additional details on targeting are disclosed in U.S. application Ser. No. 14/842,808, which was filed on Sep. 1, 2015.

FIG. 4C is a flow chart illustrating modification of the lift goal, in accordance with an exemplary embodiment of the disclosure. Referring to FIG. 4C, there are shown a flow chart 440 comprising exemplary operations 442 through 450. The exemplary operations 442 through 450 may be executed by the targeting processor 113.

At 442, targeting is initiated. At 444, it is determined whether the lift goal is achievable. If at 444 it is determined that the lift goal is not achievable, then at 448, a new achievable lift goal is determined. At 450, proceed with targeting using the newly achievable lift goal. If at 444 it is determined that the lift goal is achievable, then at 446, proceed with targeting using the original lift goal. The exemplary operations may end (done) subsequent to operations 446 and 450.

In accordance with various embodiments of the disclosure, only a portion of deals that are made may be designated as targeting deals, and not all the orders in a targeting deal have to be targeting orders. Accordingly, some deals may have no targeting orders, while other deals may have one or more targeting orders. Furthermore, it is desirable to identify inventory that can provide a certain lift when placing one or more targeting spots which could be provided certain percentage lift. The lift refers to a certain percentage over the baseline target delivery. For example, only the top 10% of the inventory for cereal buyers that could be provided a certain percentage lift may be targeted during the 39^(th) period. The placement for the spot may be modified so that the cereal advertisement is presented during the 39^(th) period when viewership of cereal buyers is at a maximum. One or more administration (admin) parameters may be utilized to set a default lift, and the default lift may be modified using the admin parameters.

In accordance with various embodiments of the disclosure, advertisement scheduling, targeting, and/or audience operation may be integrated. For advertisement scheduling, it is desirable to maximize delivery for candidate deals that are not pacing as expected in order to reduce the liability. For targeting, it is desirable to utilize the inventory that could provide a certain percentage lift when placing the targeting spots. Since there may be a high correlation between the placement of the targeting spots and the placement of the advertisement scheduling spots, the placement of the targeting spots should not consume all the available spots since this would not permit the placement of the advertisement scheduling spots to reduce the liability. In order to address this issue, a baseline target delivery may be determined for each target. The spots may then be placed to achieve a determined lift based on the baseline target delivery. For example, target A has a mean or median target delivery of 100. In order to provide a 25% lift, the baseline target delivery for target A would be 125 after placement. The determined lift is carefully determined in order to prevent over-delivery and unnecessary consumption of the airtime inventory, thereby limiting the number of inventory that may be available for advertisement scheduling. The delivery over the desired lift of spots cannot be reclaimed. For example, if the lift needed were only 10%, then providing a lift of 25% would result in a 15% additional delivery what is expected.

The average target delivery may be determined by summing all the delivery for a particular target in a 30-minute period within a bucket, and dividing by the number of deliveries of the target that occur within the 30-minute period within that bucket.

The median target delivery may be computed for each audience segment/order on each given network/selling title/week combination. The computation may be based on, for example, two main inputs, namely, (1) estimated audience segment delivery of all the half hours within that week that correspond to the parent selling title; and (2) the number of spots in the corresponding order that are scheduled in that parent selling title/week.

-   Let L represent list of half hours that correspond to the parent     selling title/week -   Let n=size of L (number of half hours); and -   Let m represent number of spots in that parent selling title/week in     the corresponding order. -   The median schedule delivery may be computed as follows: -   1. Let L^(S) be L sorted in descending order of audience segment     delivered.     -   L^(S)(i) refers to the i-th element of L^(S), i=1,2, . . . ,n. -   2. Let r=mmod n and

$c = \left\lfloor \frac{m}{n} \right\rfloor$

-   -   a. If r and n have the same parity [i.e., either n is odd and r         is odd or n is even and r is even]

${{Median}\mspace{14mu} {Schedule}\mspace{14mu} {Delivery}} = {{c{\sum\limits_{i = 1}^{n}{L^{S}(i)}}} + {\sum\limits_{i = {(\frac{r - m + 2}{2})}}^{(\frac{r + m}{2})}{L^{S}(i)}}}$

-   -   b. Else [i.e., r and m have different parities].

${{Median}\mspace{14mu} {Schedule}\mspace{14mu} {Delivery}} = {{c{\sum\limits_{i = 1}^{n}{L^{S}(i)}}} + {\sum\limits_{i = {(\frac{r - m + 1}{2})}}^{(\frac{r + m - 1}{2})}{L^{S}(i)}}}$

The lift goal may also be dynamically modified or changed over time based on actual accruals. In this regard, if the actual target is lower than the forecasted target, the lift goal may be increased in order to increase the viewership. It should be recognized that other metrics may be utilized without departing from the spirit and scope of the various embodiments of the disclosure.

In accordance with various embodiments of the disclosure, targeting may or may not be a guaranteed service and for targeting impressions that are not delivered, extra spots may sometimes be provided as compensation. In one exemplary embodiment of the disclosure, the demo delivery may be guaranteed, but the expected lift may not be guaranteed. In another exemplary embodiment of the disclosure, the demo delivery may be guaranteed, and the expected lift may also be guaranteed. In another exemplary embodiment of the disclosure, the lift may be guaranteed, but the demo delivery may not be guaranteed.

FIG. 5A is a high-level diagram illustrating exemplary audience proposal generation for a pending deal, in accordance with an exemplary embodiment of the disclosure. Referring to FIG. 5A, there are shown operations 502 through 512. Operation 504 may be referred to as a data collection 504. The data collection 504 comprise operations 504 a, . . . , 504 d. The operations 502 through 512 may occur with the advertisement management system 100, which is illustrated in FIG. 1A.

At 502, for a pending deal for an advertiser, identify the target.

During data collection 504, at 504 a, a target baseline is determined for cost per thousand (CPM) comparison. At planning 504 b, various parameters for the deal for the advertiser may be established based, for example, on the determined target CPM baseline. For example, demographics rates (demo rates) per selling title (ST) for the advertiser are established. The demo rates specify how much the advertiser should be charged per spot when buying a demo. In general, the rate that is charged for a spot which is sold by audience should be greater than or equal to the rate that is charge for selling the same spot by demo. A spot that is sold by audience may be referred to as an audience spot. At 504 c, additional constraints for the pending deal for the advertiser may be established. The additional constraints may comprise constraints that may be imposed by the planning operation 504 b. At 504 d, demo rates by selling title for every network may be generated based on historical data for the advertiser for the pending deal in accordance with the general and/or additional constraints.

At 506, audience rating estimates are gathered based on the identified target for the deal for the advertiser. The gathering of the audience rating estimates at 506 occurs concurrently with the data collection 504. The audience rating estimates for the deal for the advertiser may be gathered from the library 304, and/or the storage 310, which are illustrated in FIG. 3. The outputs from 506, and 508 are communicated to 508.

At 508, a distribution framework is utilized to generate a distribution across networks and selling title-weeks for the deal for the advertiser based, for example, on the gathered audience rating estimates from 506, and the generated demo rates by selling title for every network from 504 d. In accordance with an exemplary embodiment of the disclosure, the audience processor 153 may be operable to perform scheduling of audience spots based on a distribution of audience spots that is generated by the audience proposal creator 142 c utilizing the distribution framework. The distribution framework may also utilize the available capacity (avails) per selling title to generate the distribution. The available capacity or avails is determined by subtracting the amount of inventory that has been sold from the total inventory (total capacity). The available capacity or avails is determined for each selling title-week. In other words, the avails represent the air time that is available to allocate the spots.

At 510, the distribution generated by the distribution framework at 508 may be received. This distribution generation is part of the proposal system 142, and is referred to as the audience proposal creation.

At 512, a proposal is generated based on the received distribution for the pending deal for the advertiser.

In accordance with one embodiment of the disclosure, the identification of the target 502, and the data collection 504 may be handled by the proposal system 142.

The generation of the audience rating estimates may be handled by the audience rating estimate generator 305, and the audience proposal creator 142 c may gather or acquire the audience rating estimates from the storage 310 and/or the library 304. The generation of the distribution by the distribution framework at 508 may be handled by the audience proposal creator 142 c.

It should readily be understood that although a proposal is generated at 512, this proposal may be an interim proposal and not a final proposal. In this regard, the proposal generated at 512 may be communicated to the planning 504 b of the data collection 504 for review and acceptance. If the planning 504 b and the advertiser accepts the proposal, the proposal becomes a finalized proposal. If the planning 504 b and/or the advertiser rejects the proposal, the additional constraints may be added at 504 c, and operations 504 d, 508, 510, and 512 are repeated until the planning 504 b and the advertiser accepts the generated proposal. In this regard, one or more iterations may occur in order to generate a finalized proposal.

In accordance with one embodiment of the disclosure, there may or may not be a guarantee on the demo portion of the deal. However, there may be a guarantee on the audience portion of the deal.

FIG. 5B is a diagram that illustrates example audience planning for a pending deal for an advertiser, in accordance with an exemplary embodiment of the disclosure. Referring to FIG. 5B, there is shown planning operation 504 b. Planning operation 504 b may include parameters 534 for the deal for the advertiser, a previous period (old) proposal 530, and a new proposal 532 using audience operation.

The parameters 534 for the deal for the advertiser comprise budget parameters 534 a, target CPM reduction parameter 534 b, and demo CPM parameter 534 c. The parameters 534 are negotiated between the advertiser and the broadcast provider. The parameters 534 may be referred to as general constraints. Optional constraints may comprise, for example, maximum units per selling title-week, a limit on the total number of units in the deal, maximum impression and/or unit percentages (%) by network or selling title, and limits on rate increases and whether or not to increase the rates in the same proportion. The maximum units per selling title-week represents the maximum number or units that may be allocated to a selling title-week. The number of units limit represents a limit or cap on the total number of units for the particular budget. The impression and/or unit percentages (%) by network or selling title represents the maximum percentage of impressions and/or units per network or selling title that can be allocated. The optional parameters may also be negotiated between the advertiser and the broadcast provider and/or may be imposed as part of the planning operation 504 b. For example, the general and/or optional parameters may be imposed during the one or more iterations that may occur in order to generate a finalized proposal. For example, the proposal system 142 may be operable to impose the general and/or optional constraints.

The budget parameters 534 a represent the total amount that the advertiser wants or desires to spend on the deal, and which is to be distributed across all the units. The target CPM reduction parameter 534 b represents the percentage by which the planning operation 504 b will reduce the CPM for the target. The demo CPM parameter 534 c represents a cap or maximum percentage by which the planning operation 504 b will increase the demo CPM.

The previous period proposal 530 represents the previous deal that was made by the advertiser. As illustrated, for the previous period proposal 530 included a demo CPM of $100, and a target CPM of $180. It should be recognized by one skilled in the art that the invention is not limited to the use of the single previous period proposal 530. Accordingly, a plurality of other previous period proposals or other information may be utilized. For example, the previous year proposal 530 could be used along with audience rating estimates for the current year to determine the demo CPM and/or target CPM.

A goal of the new proposal 532 is to reduce the target CPM that was or would have been paid in the previous period proposal 530. Accordingly, in the new proposal 532, a target CPM is calculated based on the target CPM reduction parameter 534 b of 5%. Accordingly, in the new proposal 532, the target CPM is $171, and this is designated as the goal for the target CPM. Additionally, in the new proposal 532, a new demo CPM cap of $105 is calculated based on the demo CPM parameter 534 c of 5%. Under the new proposal 532, the target CPM will be decreased by 5% to $171 without causing an increase of more than 5% in the demo CPM. In other words, the demo CPM is going to be capped at $105.

FIG. 6 is a diagram that illustrates a distribution framework that may be utilized to generate distribution across networks and selling title and weeks combination, in accordance with an exemplary embodiment of the disclosure. Referring to FIG. 6, there is shown a grid 600 that may be utilized for generating a distribution across networks and selling title-weeks combinations. The grid 600 illustrates a mapping of all selling titles for all available networks 602 to a planning horizon 608, which is represented in weeks.

The networks 604 are referenced as NET1, NETm, where m is an integer that is greater than or equal to 1. The selling titles (ST) 606 are referenced as ST1, . . . , STn, where n is an integer that is greater than or equal to 1. All the selling titles for network 1 (NET1) are referenced as ST1[NET1], STn[NET1]. All the selling titles for network 2 (NET2) are referenced as ST1[NET2], STn[NET2]. All the selling titles for network m (NETm) are referenced as ST1[NETm], STn[NETm].

The planning horizon 608 represents the weeks for the duration of the deal, and may be 1 quarter (Qtr) or 13 weeks, 2 Qtrs or 26 weeks, 3 Qtrs or 39 weeks, 4 Qtrs or 52 weeks, and so on. The weeks are referenced as W1, W2, . . . Wx, where x is an integer greater than or equal to 1.

For network 1, selling title 1, week 1, may be represented as ST1[NET1]W1, 612. For network 2, selling title n, week 2, may be represented as STn[NET2]W2, 614. For network 2, selling title 2, week 7, may be represented as ST2[NET2]W7, 616. For network m, selling title n, week x, may be represented as STn[NETm]Wx, 618.

For each network, and for each selling title-week combination, there is a corresponding rate parameter, demographics (demo) impressions or audience for each demo parameter, and target impressions or audience for each target parameter, which are referenced as parameters 610. The parameters 610 may be represented as a vector. Accordingly, parameters 610 may be referred to as parameter matrix or a parameter vector. The rate parameter may be constant across all the weeks or may vary across one or more weeks. For example, the rate parameter may vary based on quarter or other criteria such as, for example, demand. The demo impressions for each demo parameter is a vector that represents an estimate of the average demo impressions for each demo for each selling title and week combination. The target impressions for each target parameter is a vector that represents an estimate of the average target impressions or audience for each target for each selling title and week combination. The avails parameter represents the air time that is available to allocate the spots.

Other inputs to the distribution framework include the parameters 534 for the deal, namely, the advertiser budget parameters 534 a, target CPM reduction parameter 534 b, and demographics CPM maximum percentage increase parameter 534 c, which may be referred to as general constraints. Optional constraints that may be input to the distribution framework may comprise, for example, maximum units per selling title-week, a limit on the total number of units, impression and/or unit percentages (%) by network or selling title, and limits on rate increases and whether or not to increase them in the same proportion. Some of the inputs to the distribution framework may be hard constraints that have to be satisfied. For example, the budget parameters 534, target CPM reduction parameter 534 b, demo CPM maximum percentage increase parameter 534 c, avails parameter, maximum units per selling title-week, number of units limit, and limits on rate increases may be hard constraints. Due to differences in availability of units throughout the quarter, it may be necessary to skew the distribution for a specified period of time, for example, a number of weeks. Accordingly, some embodiments of the disclosure may comprise a skewing factor that may be utilized to skew the distribution for a specified period of time. Additional inputs include the rates per selling title which will be used as the floor (minimum) prices to determine the value of the units allocated to the deal. This means that the rates could be increased as a part of the distribution framework, but they cannot be decreased. It should be understood by one skilled in the art that although a rate decrease may not be desirable, the distribution framework may accommodate a decrease in rate if needed.

The distribution framework utilizes the inputs to determine, for each deal, for each advertiser, a distribution or schedule of units for each selling title-week combination as well as the final rates to be charge for the units on a selling title. In this regard, the distribution framework is operable to determine how many units are to be assigned or allocated to each selling title and week combination for each deal. In other words, the distribution framework determines how many units are to be assigned or allocated across all the available selling titles, across one or more networks, and across all the weeks such that all constraints are satisfied. For example, a distribution should never assign more units to a selling title-week than the number of units that are available for that selling title on that specific week. In addition to determining the number of units that are to be assigned or allocated across all the available selling titles, across one or more of the networks, and across all the weeks, the distribution model utilizes an objective function to determine how much will be actually charged per unit for each selling title and week combination. The objective function maximizes how much the rate effectiveness can be increased.

The product of the allocated units per selling title and week combination, and the demo impressions yields the number of demo impressions per selling title and week combination. The demo CPM is then determined by dividing the budget by the total number of demo impressions across all selling title and week combinations. The product of the allocated units per selling title and week combination, and the target impressions yields the number of target impressions per selling title and week combination. The target CPM is then determined by dividing the budget by the total number of target impressions across all selling title and week combinations.

The distribution model implicitly examines all possible combinations of schedule allocations and rate increments and determines which combination of schedule allocations and rate increments will provide the maximum rate effectiveness increase while at the same time meeting the budget, the target CPM, the demo CPM, and the constraints.

In accordance with an exemplary embodiment of the disclosure, a high level description of a formulation is provided to compute or determine the unit distribution and unit pricing in the audience proposal creator 142 c. The audience proposal creator 142 c may utilize the following exemplary parameters, decision variables, and formulation:

Parameters:

-   -   R_(sw)=Rate for units of selling title s in week w (may be         constant across weeks).     -   Δ_(T)=Percentage reduction in target CPM.     -   C^(T)=Baseline for target CPM.     -   Δ_(D)=Maximum percentage increase (cap) in demo CPM.     -   C^(D)=Baseline for demo CPM.     -   B=Advertiser budget.     -   Â_(sw) ^(D)=Estimated demo impressions on selling title s in         week w.     -   Â_(sw) ^(T)=Estimated target impressions on selling title s in         week w.     -   I_(sw)=Number of available airtime units on selling title s in         week w.

Decision Variables:

-   -   ρ_(sw)=Increment in the rate for selling title s in week w.     -   x_(sw)=Number of units to be allocated on selling title s in         week w.

Formulation:

-   -   Maximize Σ_(s)Σ_(w)ρ_(sw)x_(sw)

Such that

$\begin{matrix} {\frac{\Sigma_{s}{\Sigma_{w}\left( {R_{sw} + \rho_{sw}} \right)}x_{sw}}{\Sigma_{s}\Sigma_{w}A_{sw}^{D}x_{sw}} \leq {\left( {1 + \Delta_{D}} \right)C^{D}}} & {{Constraint}\mspace{14mu} 1} \\ {\frac{\Sigma_{s}{\Sigma_{w}\left( {R_{sw} + \rho_{sw}} \right)}x_{sw}}{\Sigma_{s}\Sigma_{w}A_{sw}^{T}x_{sw}} \leq {\left( {1 + \Delta_{T}} \right)C^{T}}} & {{Constraint}\mspace{14mu} 2} \\ {{\Sigma_{s}{\Sigma_{w}\left( {R_{sw} + \rho_{sw}} \right)}x_{sw}} \leq B} & {{Constraint}\mspace{14mu} 3} \\ {x_{sw} \leq I_{sw}} & {{Constraint}\mspace{14mu} 4} \\ {x_{sw} \in Z^{+}} & \; \\ {\rho_{sw} \in R^{+}} & \; \end{matrix}$

Let the rate efficiency (RE) of a unit distribution and pricing be defined as the sum of the rate increments times the number of units allocated across all selling title-weeks, i.e., rate efficiency,

RE=Σ_(s)Σ_(w)ρ_(sw)x_(sw) .

Exemplary steps for determining the unit distribution and unit pricing may comprise solving the formulation that maximizes the rate efficiency resulting from the unit distribution and pricing across all selling title-weeks subject to restrictions on the demo CPM, target CPM, advertiser's budget, number of units available per selling title-week, as well as other additional constraints. The first constraint (constraint 1) enforces that the unit distribution and pricing will result in a demo CPM which does not exceed the maximum percentage increase with respect to the baseline demo CPM. The second constraint (constraint 2) enforces that the unit distribution and pricing will result in a target CPM which does not exceed the reduced percentage with respect to the baseline target CPM. The third constraint (constraint 3) enforces that the unit pricing and distribution must not exceed the advertiser's budget. The fourth constraint (constraint 4) establishes that the unit distribution is limited by the number of units that are available for each selling title-week. Finally, variables x_(sw) are defined over the set of nonnegative integers, whereas variables ρ_(sw) are defined over the set of nonnegative real numbers.

This formulation for the mathematical programming model can also accommodate other additional constraints that may appear depending on the negotiations with the advertiser. Examples of these additional constraints include, but are not limited to, for example:

-   -   Maximum number of units (total, by network, by selling title, by         selling title-week)     -   Maximum percentage of total impressions (by network, by selling         title)     -   Equitable distribution across weeks or skewed distribution based         on relative avails across weeks.     -   Limits on the rate increments.     -   Rate increments proportional to original rates, target         impressions, etc.

FIG. 7 is a high-level flow chart illustrating exemplary audience placement for advertiser spots that have an audience guarantee, in accordance with an exemplary embodiment of the disclosure. Referring to FIG. 7, there are shown exemplary operations 702 through 714. The exemplary operations 702 through 714 may be performed by one or more of the components and functions of the television management system 100.

At 702, the spot scheduler job is initiated. At 704, it is determined whether the job contains audience spots. At 704, if it is determined that the job contains audience spots, then at 706, it is determined whether the prior week log is in a state to run audience operation. At 706, if it is determined that the prior week log is in a state that allows running of the audience operation, then at 708, audience segment estimates for all audience segment in job are acquired. At 710, spots are placed based on audience guarantee. At 712, audience spots on the log are flagged or otherwise marked after placement. The flagging or marking of the audience spots on the log after placement serves as a notification that the spot was placed by the audience operation and cautions movement of the audience spot.

If at 706, it is determined that the prior week log is not in a state that allows running of the audience operation, then at 714, the job is not an audience operation job. If at 704, it is determined that job does not contain audience spots, then at 714, the job is not an audience operation job. The exemplary operations may end (done) after 714.

FIG. 8 is a flow chart illustrating exemplary operations for providing spot scheduling with advertisement scheduling, targeting, and/or audience scheduling, in accordance with an exemplary embodiment of the disclosure. The exemplary operations 802 through 852 may be performed by one or more of the components and functions of the television management system 100.

At 802, the spot scheduler job is initiated. At 804, it is determined whether the prior week log is in a state to run advertisement scheduler, targeting, and/or audience scheduling. If at 804, it is determined that the prior week log is not in a state that allows running of the advertisement scheduler, targeting, and/or audience scheduling then at 850, the job is a spot scheduler job. The exemplary operations may end thereafter. If at 804 it is determined that the prior week log is in a state to run advertisement scheduler, targeting, and/or audience scheduling, then at 806, it is determined whether the job is an advertisement scheduler job.

At 806, if it is determined that the job is an advertisement scheduler job, then at 808, calculate the liability per pending spot and generate corresponding estimates. The exemplary operations then proceed to 810, where it is determined whether there is a targeted spot in the job. At 810, if it is determined that there is a targeted spot in the job, then the exemplary operations proceed to 812, where it is determined whether there is an audience spot in the job. At 812, if there is an audience spot in the job, then at 814, acquire target audience rating estimates. For example, the target audience rating estimates may be acquired from the storage 310 (FIG. 3). At 816, perform rotation, audience optimization, targeting, advertisement scheduler, and placement, and modify the lift goal if needed. The exemplary operations then proceed to 852, where additional processing is performed as needed to clean up the bucket.

If at 812, it is determined that there is no audience spot in the job, then at 818, acquire target audience rating estimates. At 820, perform rotation, optimization with advertisement scheduler and targeting, and placement, and modify the lift goal if needed. The exemplary operations then proceed to 852, where additional processing is performed as needed to clean up the bucket, for example, process associated constraints, such as book ends, on the spots. At 816, and 820, when performing targeting, it is determined whether the goals are achievable. If it is determined that the goals are not achievable, then the goals may be modified so that they are achievable. For example, if the goal is to provide a lift of 25%, and it is determined that only a lift of 23% may be provided, then the goal is modified to provide a lift of 23%.

If at 810, it is determined that there is no targeted spot in the job, then at 822, it is determined whether there is an audience spot in the job. If at 822, it is determined that there is an audience spot in the job, then at 824, acquire target audience rating estimates. For example, the target audience rating estimates may be acquired from the storage 310 (FIG. 3). At 826, perform audience optimization, optimization with advertisement scheduler, and placement. The exemplary operations then proceed to 852, where additional processing is performed as needed to clean up the bucket, for example, process associated constraints, such as book ends, on the spots. If at 822 it is determined that there is no audience spot in the job, then at 828, perform rotation, optimization with advertisement scheduler, and placement. The exemplary operations then proceed to 852, where additional processing is performed as needed to clean up the bucket, for example, process associated constraints, such as book ends, on the spots.

If at 806, it is determined that the job is not an advertisement scheduler job, then at 830, it is determined whether the job is a targeted job. If at 830, it is determined that the job is a targeted job, then at 832, it is determined whether there is an audience spot in the job. If at 832, it is determined that there is an audience spot in the job, then at 834, acquire target audience rating estimates. For example, the target audience rating estimates may be acquired from the storage 310 (FIG. 3). At 836, perform rotation, audience optimization, targeting optimization, and placement, and modify the lift goal if needed. The exemplary operations then proceed to 852, where additional processing is performed as needed to clean up the bucket, for example, process associated constraints, such as book ends, on the spots.

If at 832, it is determined that there is no audience spot in the job, then at 838, acquire target audience rating estimates. At 846, perform rotation, optimization with targeting, and placement, and modify the lift goal if needed. The exemplary operations then proceed to 852, where additional processing is performed as needed to clean up the bucket, for example, process associated constraints, such as book ends, on the spots. At 836, and 846, when performing targeting, it is determined whether the goals are achievable. If it is determined that the goals are not achievable, then the goals may be modified so that they are achievable.

If at 830, is it is determined that the job is not a targeted job, then at 842, it is determined whether there is an audience spot in the job. If at 842, it is determined that there is an audience spot in the job, then at 844, acquire the target audience rating estimates. At 848, perform rotation, audience optimization, and placement. The exemplary operations then proceed to 852, where additional processing is performed as needed to clean up the bucket, for example, process associated constraints, such as book ends, on the spots. If at 842, it is determined that there is no audience spot in the job, then at 850, the job is a spot scheduler job. The exemplary operations end (done) after 852.

FIG. 9 is a conceptual diagram illustrating an example of a hardware implementation for a television advertisement management system employing a processing system for audience proposal creation and spot scheduling utilizing a framework for audience rating estimation, in accordance with an exemplary embodiment of the disclosure. Referring to FIG. 9, the hardware implementation 900 for the television advertisement management system 100 of FIG. 1A employs a processing system 914 for audience proposal creation and spot scheduling utilizing the framework for audience rating estimation, as described herein. In some examples, the processing system 914 may comprise one or more hardware processors 904, a spot scheduler solver component 110, an advertisement scheduler component 112, a targeting component 113, and an audience component 114.

In this example, the television advertisement management system 100 employing the processing system 914 may be implemented with a bus architecture, represented generally by the bus 902. The bus 902 may include any number of interconnecting buses and bridges depending on the specific implementation of the television advertisement management system 100 and the overall design constraints. The bus 902 links together various circuits including one or more processors, represented generally by the processor 904, computer-readable media, represented generally by the computer-readable medium 906, the spot scheduler component 110, the advertisement scheduler component 112, the targeting component 113, and the audience component 114 (which correspond to the spot scheduler 110, the advertisement scheduler 112, the targeting processor 113, and the audience processor 114, respectively, which are illustrated in illustrated in FIG. 1A), which may be configured to carry out one or more methods or procedures described herein.

The bus interface 908 provides an interface between the bus 902 and a transceiver 916. The transceiver 916 provides a means for communicating via the network 120 with various other apparatus such as the advertiser order generation systems 130 a, . . . , 130 n and the consumer devices 132 a, . . . , 132 n (FIG. 1A). The user interface 918 (e.g., keypad, display, speaker, microphone, pointing) may also be provided to enable a user to interact with the television advertisement management system 100 (FIG. 1A). In accordance with an aspect of the disclosure, the user interface 918 may enable user interaction with the television advertisement management system 100. For example, the user interface 918 may be utilized to enter administration (admin) and/or configuration parameters.

The processor 904 may be operable to manage the bus 902 and general processing, including the execution of software stored on the computer-readable medium 906. In accordance with an embodiment of the disclosure, the processor 904 may be operable to control the operation of the television advertisement management system 100 (FIG. 1A), and may be operable to coordinate operation amongst the components therein, as well as with entities external to the television advertisement management system 100. The software, when executed by the processor 904, causes the television advertisement management system 100 to perform the various functions and/or operations described infra for any particular apparatus. The computer-readable medium 906 may also be used for storing data that is manipulated by the processor 904 when executing software.

In an aspect, processor 904, computer-readable medium 906, or a combination of both may be configured or otherwise specially programmed to perform the functionality of the spot scheduler component 110, the advertisement scheduler component 112, the targeting component 113, the audience component 114, (corresponding to the spot scheduler 110, advertisement scheduler 112, targeting processor 113, and audience processor 114, respectively, which are illustrated in FIG. 1A), the television management advertisement management system 100, or various other components described herein. For example, the processor 904, the computer-readable medium 906, or a combination of both may be configured or otherwise specially programmed to perform the functionality of the spot scheduler component 110, the advertisement scheduler component 112, the targeting component 113, the audience component 114, and/or components thereof, etc. described herein (e.g., the operations 160 in FIG. 1C, the operations 300 in FIG. 3, the operations 400 in FIG. 4A, the operations 420 in FIG. 4B, the operations 440 in FIG. 4C, the operations in FIG. 5A-5B, the operations 700 in FIG. 7, etc.), and the operations 800 in FIG. 8, and/or the like.)

In accordance with an exemplary embodiment of the disclosure, a hardware advertisement management system communicates with a plurality of advertiser order generation systems and electronically receives, via a communication network, deals comprising orders from advertisers. An audience proposal creator 142 c in the hardware advertisement management system may determine a target CPM baseline and demo CPM baseline for a pending deal for an advertiser in which audience spots will be offered. The audience proposal creator 142 c may establish parameters for the pending deal for the advertiser, determine constraints to be imposed on the pending deal based on the target CPM reduction goal, a demographics CPM cap, and the established parameters, and generate rates by selling title for each selling title of a plurality of selling titles, for each week of a plurality of weeks for a duration of pending deal, and for each network of a plurality of networks, for the pending deal for the advertiser, based on the constraints. Concurrent with the establishing of the parameters, the determining of the constraints, and the generating of the rates by selling title, the audience proposal creator 142 c may acquire target audience rating estimates based on the target and demo applicable to the advertiser for the plurality of networks. The audience proposal creator 142 c may generate a distribution of the audience spots across the plurality of selling titles, the plurality of weeks, and the plurality of networks based at least in part on the target audience rating estimates, a budget for the pending deal, the generated rates by selling title, and available inventory per selling title and weeks combination. The generated distribution satisfies the determined constraints as part of the process of generating the distribution. The audience proposal creator 142 c may generate a proposal based on the distribution. The audience processor 153 or 114 may schedule audience spots across one or more networks for selling title and weeks combinations based on the generated distribution.

The generation of the distribution of the audience spots by the audience proposal creator 142 c includes generating a new distribution of the audience spots across the plurality of selling titles, the plurality of weeks, and the plurality of networks based on input from the advertiser, and generating a new proposal based on the new distribution. The audience proposal creator 142 c may designate the new proposal as a final proposal. The audience processor 153 or 114 may schedule the audience spots across one or more networks for selling title and weeks combinations based on the new distribution.

Exemplary parameters for the pending deal may include the budget, a target CPM reduction goal, the demographics CPM cap, and demographics rates per selling title to be charged per spot for the pending deal for the advertiser. The audience proposal creator 142 c may be operable to generate the distribution of the audience spots utilizing a distribution framework. Exemplary inputs to the distribution framework may include the budget, the target CPM reduction goal, and the demographics CPM cap. Other exemplary inputs to the distribution framework may include one or more of a maximum number of units to be allocated per selling title and week combination, a limit on the total number of units in the pending deal, a limit on the number of impressions and/or units percentages by network or selling title, a limit on rate increase, and an indication of whether to increase the rates in the same proportion. The target impressions corresponding to the distribution of the audience spots are guaranteed.

The concurrent operation of the audience proposal creator 142 c to handle the establishing of the parameters, the determining of the constraints, and the generating of the rates by selling title, and to acquire target audience rating estimates based on the target CPM baseline, and the demographics CPM cap for the plurality of networks enables the television advertisement management system 100 to operate more efficiently since the processing and memory may be more efficiently utilized by the concurrent operations. The concurrent operation also increases the operating speed (faster computation time without sacrificing accuracy) of the television advertisement management system 100 when generating the distribution of the audience spots across the plurality of selling titles, the plurality of weeks, and the plurality of networks based at least in part on the target audience rating estimates, a budget for the pending deal, the generated rates by selling title, and available inventory per selling title-weeks. The television advertisement management system 100 operates faster and more efficiently to accommodate distributing units across selling titles in multiple networks at the same time or concurrently, and can operate to process impressions from more targeted audience segments which are smaller than broader demographics expressed in terms of age and gender. The concurrent operation and use of the data for the framework for target audience rating estimation and demo audience rating estimation may utilize less memory than would otherwise be required resulting in much faster processing time.

The word “exemplary” is used herein to mean “serving as an example, instance, or illustration.” Any embodiment described herein as “exemplary” is not necessarily to be construed as preferred or advantageous over other embodiments. Likewise, the term “embodiments of the invention” does not require that all embodiments of the invention include the discussed feature, advantage or mode of operation.

As utilized herein the terms “circuits” and “circuitry” refer to physical electronic components (i.e. hardware) and any software and/or firmware (“code”) which may configure the hardware, be executed by the hardware, and/or otherwise be associated with the hardware. As used herein, for example, a particular processor and memory may comprise a first “circuit” when executing a first one or more lines of code and may comprise a second “circuit” when executing a second one or more lines of code. As utilized herein, “and/or” means any one or more of the items in the list joined by “and/or”. As an example, “x and/or y” means any element of the three-element set {(x), (y), (x, y)}. As another example, “x, y, and/or z” means any element of the seven-element set {(x), (y), (z), (x, y), (x, z), (y, z), (x, y, z)}. As utilized herein, the term “exemplary” means serving as a non-limiting example, instance, or illustration. As utilized herein, the terms “e.g.,” and “for example” set off lists of one or more non-limiting examples, instances, or illustrations. As utilized herein, circuitry is “operable” to perform a function whenever the circuitry comprises the necessary hardware and code (if any is necessary) to perform the function, regardless of whether performance of the function is disabled, or not enabled, by some user-configurable setting.

The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of embodiments of the invention. As used herein, the singular forms “a”, an and the are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will be further understood that the terms “comprises”, “comprising,”, “includes” and/or “including”, when used herein, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof.

Further, many embodiments are described in terms of sequences of actions to be performed by, for example, elements of a computing device. It will be recognized that various actions described herein can be performed by specific circuits (e.g., application specific integrated circuits (ASICs)), by program instructions being executed by one or more processors, or by a combination of both. Additionally, these sequence of actions described herein can be considered to be embodied entirely within any non-transitory form of computer readable storage medium having stored therein a corresponding set of computer instructions that upon execution would cause an associated processor to perform the functionality described herein. Thus, the various aspects of the disclosure may be embodied in a number of different forms, all of which have been contemplated to be within the scope of the claimed subject matter. In addition, for each of the embodiments described herein, the corresponding form of any such embodiments may be described herein as, for example, “logic configured to” perform the described action.

Another embodiment of the disclosure may provide a non-transitory machine and/or computer readable storage and/or media, having stored thereon, a machine code and/or a computer program having at least one code section executable by a machine and/or a computer, thereby causing the machine and/or computer to perform the operations and/or steps as described herein for targeting and demographics scheduling utilizing the framework for audience rating estimation.

The present invention may also be embedded in a computer program product, which comprises all the features enabling the implementation of the methods described herein, and which when loaded in a computer system is able to carry out these methods. Computer program in the present context means any expression, in any language, code or notation, of a set of instructions intended to cause a system having an information processing capability to perform a particular function either directly or after either or both of the following: a) conversion to another language, code or notation; b) reproduction in a different material form.

Further, those of skill in the art will appreciate that the various illustrative logical blocks, modules, circuits, algorithm, operations, and/or steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware, computer software, firmware, or combinations thereof. To clearly illustrate this interchangeability of hardware and software, various illustrative components, blocks, modules, circuits, operations, and steps have been described above generally in terms of their functionality. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the overall system. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present invention.

The methods, sequences and/or algorithms described in connection with the embodiments disclosed herein may be embodied directly in firmware, hardware, in a software module executed by a processor, or in a combination thereof. A software module may reside in RAM memory, flash memory, ROM memory, EPROM memory, EEPROM memory, registers, hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art. An exemplary storage medium is coupled to the processor such that the processor can read information from, and write information to, the storage medium. In the alternative, the storage medium may be integral to the processor.

While the present invention has been described with reference to certain embodiments, it will be noted understood by, for example, those skilled in the art that various changes and modification could be made and equivalents may be substituted without departing from the scope of the present invention as defined, for example, in the appended claims. In addition, many modifications may be made to adapt a particular situation or material to the teachings of the present invention without departing from its scope. The functions, operations, steps and/or actions of the method claims in accordance with the embodiments of the invention described herein need not be performed in any particular order. Furthermore, although elements of the invention may be described or claimed in the singular, the plural is contemplated unless limitation to the singular is explicitly stated. Therefore, it is intended that the present invention not be limited to the particular embodiment disclosed, but that the present invention will include all embodiments falling within the scope of the appended claims. 

What is claimed is:
 1. A method, comprising: in a hardware advertisement management system that communicates with a plurality of advertiser order generation systems and electronically receives, via a communication network, deals comprising orders from advertisers: determining a target cost per thousand (CPM) baseline and a demographics CPM baseline for a pending deal for an advertiser in which audience spots will be offered; establishing parameters for the pending deal for the advertiser; determining constraints to be imposed on the pending deal based on a target CPM reduction goal, a demographics CPM cap, and the established parameters; generating rates by selling title for each selling title of a plurality of selling titles, for each week of a plurality of weeks for a duration of pending deal, and for each network of a plurality of networks, for the pending deal for the advertiser, based on the constraints; concurrent with the establishing of the parameters, the determining of the constraints, and the generating of the rates by selling title, acquiring target audience rating estimates based on the target CPM reduction goal, and the demographics CPM cap for the plurality of networks; generating a distribution of the audience spots across the plurality of selling titles, the plurality of weeks, and the plurality of networks based at least in part on the target audience rating estimates, a budget for the pending deal, the generated rates by selling title, and available inventory per selling title and weeks combination; and generating a proposal based on the distribution.
 2. The method according to claim 1, comprising scheduling audience spots across one or more networks for selling title and weeks combinations based on the generated distribution.
 3. The method according to claim 1, wherein the generated distribution satisfies the determined constraints.
 4. The method according to claim 3, wherein the generation of the distribution of the audience spots, comprises: generating a new distribution of the audience spots across the plurality of selling titles, the plurality of weeks, and the plurality of networks based on input from the advertiser; and generating a new proposal based on the new distribution.
 5. The method according to claim 4, comprising designating the new proposal as a final proposal.
 6. The method according to claim 4, comprising scheduling audience spots across one or more networks for selling title and weeks combinations based on the new distribution.
 7. The method according to claim 1, wherein the parameters for the pending deal comprise the budget, the target CPM reduction goal, the demographics CPM cap, and demographics rates per selling title to be charged per spot for the pending deal for the advertiser.
 8. The method according to claim 1, comprising generating the distribution of the audience spots utilizing a distribution framework, wherein inputs to the distribution framework comprise the budget, the target CPM reduction goal, and the demographics CPM cap.
 9. The method according to claim 8, wherein inputs to the distribution framework further comprise one or more of a maximum number of units to be allocated per selling title and week combination, a limit on the total number of units in the pending deal, a limit on the number of impressions and/or units percentages by network or selling title, a limit on rate increase, and an indication of whether to increase the rates in the same proportion.
 10. The method according to claim 1, wherein target impressions corresponding to the distribution of the audience spots are guaranteed.
 11. A system, comprising: one or more processors for use in a hardware advertisement management system that communicates with a plurality of advertiser order generation systems and electronically receives, via a communication network, deals comprising orders from advertisers, the one or more processors being operable to: determine a target cost per thousand (CPM) baseline and a demographics CPM baseline for a pending deal for an advertiser in which audience spots will be offered; establish parameters for the pending deal for the advertiser; determine constraints to be imposed on the pending deal based on a target CPM reduction goal, a demographics CPM cap, and the established parameters; generate rates by selling title for each selling title of a plurality of selling titles, for each week of a plurality of weeks for a duration of pending deal, and for each network of a plurality of networks, for the pending deal for the advertiser, based on the constraints; concurrent with the establish parameters, the determine constraints, and the generate rates by selling title, acquire target audience rating estimates based on the target CPM reduction goal, and the demographics CPM cap for the plurality of networks; generate a distribution of the audience spots across the plurality of selling titles, the plurality of weeks, and the plurality of networks based at least in part on the target audience rating estimates, a budget for the pending deal, the generated rates by selling title, and available inventory per selling title and weeks combination; and generate a proposal based on the distribution.
 12. The system according to claim 11, wherein the one or more processors schedule audience spots across one or more networks for selling title and weeks combinations based on the generated distribution.
 13. The system according to claim 11, wherein the generated distribution satisfies the determined constraints.
 14. The system according to claim 13, wherein for the generation of the distribution of the audience spots, the one or more processors: generate a new distribution of the audience spots across the plurality of selling titles, the plurality of weeks, and the plurality of networks based on input from the advertiser; and generate a new proposal based on the new distribution.
 15. The system according to claim 14, wherein the one or more processors designate the new proposal as a final proposal.
 16. The system according to claim 14, wherein the one or more processors schedule audience spots across one or more networks for selling title and weeks combinations based on the new distribution.
 17. The system according to claim 11, wherein the parameters for the pending deal comprise the budget, the target CPM reduction goal, the demographics CPM cap, and demographics rates per selling title to be charged per spot for the pending deal for the advertiser.
 18. The system according to claim 11, wherein the one or more processors generate the distribution of the audience spots utilizing a distribution framework, wherein inputs to the distribution framework comprise the budget, the target CPM reduction goal, and the demographics CPM cap.
 19. The system according to claim 18, wherein inputs to the distribution framework further comprise one or more of a maximum number of units to be allocated per selling title and week combination, a limit on the total number of units in the pending deal, a limit on the number of impressions and/or units percentages by network or selling title, a limit on rate increase, and an indication of whether to increase the rates in the same proportion.
 20. The system according to claim 11, wherein target impressions corresponding to the distribution of the audience spots are guaranteed.
 21. A non-transitory computer-readable medium in a hardware advertisement management system that communicates with a plurality of advertiser order generation systems and electronically receives, via a communication network, deals comprising orders from advertisers, the hardware advertisement management system comprising code for: determining a target cost per thousand (CPM) baseline and a demographics CPM baseline for a pending deal for an advertiser in which audience spots will be offered; establishing parameters for the pending deal for the advertiser; determining constraints to be imposed on the pending deal based on a target CPM reduction goal, a demographics CPM cap, and the established parameters; generating rates by selling title for each selling title of a plurality of selling titles, for each week of a plurality of weeks for a duration of pending deal, and for each network of a plurality of networks, for the pending deal for the advertiser, based on the constraints; concurrent with the establishing of the parameters, the determining of the constraints, and the generating of the rates by selling title, acquiring target audience rating estimates based on the target CPM reduction goal, and the demographics CPM cap for the plurality of networks; generating a distribution of the audience spots across the plurality of selling titles, the plurality of weeks, and the plurality of networks based at least in part on the target audience rating estimates, a budget for the pending deal, the generated rates by selling title, and available inventory per selling title and weeks combination; and generating a proposal based on the distribution.
 22. The non-transitory computer-readable medium according to claim 21, comprising code for scheduling audience spots across one or more networks for selling title and weeks combinations based on the generated distribution.
 23. The non-transitory computer-readable medium according to claim 21, wherein the generated distribution satisfies the determined constraints.
 24. The non-transitory computer-readable medium according to claim 23, wherein the generation of the distribution of the audience spots, comprises code for: generating a new distribution of the audience spots across the plurality of selling titles, the plurality of weeks, and the plurality of networks based on input from the advertiser; and generating a new proposal based on the new distribution.
 25. The non-transitory computer-readable medium according to claim 24, comprising code for designating the new proposal as a final proposal.
 26. The non-transitory computer-readable medium according to claim 24, comprising code for scheduling audience spots across one or more networks for selling title and weeks combinations based on the new distribution.
 27. The non-transitory computer-readable medium according to claim 21, wherein the parameters for the pending deal comprise the budget, the target CPM reduction goal, the demographics CPM cap, and demographics rates per selling title to be charged per spot for the pending deal for the advertiser.
 28. The non-transitory computer-readable medium according to claim 21, comprising code for generating the distribution of the audience spots utilizing a distribution framework, wherein inputs to the distribution framework comprise the budget, the target CPM reduction goal, and the demographics CPM cap.
 29. The non-transitory computer-readable medium according to claim 28, wherein inputs to the distribution framework further comprise one or more of a maximum number of units to be allocated per selling title and week combination, a limit on the total number of units in the pending deal, a limit on the number of impressions and/or units percentages by network or selling title, a limit on rate increase, and an indication of whether to increase the rates in the same proportion.
 30. The non-transitory computer-readable medium according to claim 21, wherein target impressions corresponding to the distribution of the audience spots are guaranteed. 